Entropy and Channel Capacity in the Regenerative Setup with Applications to Markov Channels
نویسنده
چکیده
We obtain n e w entropy and m u t u a l information formulae for regenerative stochastic processes. We use them on Markov channels to generalize the resul ts i n Goldsmi th and Varaiya [3]. Also w e obtain tighter bounds on capaci ty and better algori thms than in [3].
منابع مشابه
Predicting Shear Stress Distribution in Rectangular Channels Using Entropy Concept
This study makes use of the Tsallis entropy to predict the shear stress distribution. Given a definition of the Tsallis entropy, it is maximized by using the probability density function, which then is used to attain a novel shear stress equation. This is then employed for calculating the shear stress distribution in rectangular channels in different aspect ratios and finally, for viability, th...
متن کاملOn Entropy and Lyapunov Exponents for Finite-State Channels
The Finite-State Markov Channel (FSMC) is a time-varying channel having states that are characterized by a finite-state Markov chain. These channels have infinite memory, which complicates their capacity analysis. We develop a new method to characterize the capacity of these channels based on Lyapunov exponents. Specifically, we show that the input, output, and conditional entropies for this ch...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملBounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کامل